The Fibonacci Unimodal Map
نویسندگان
چکیده
The Fibonacci recurrence of the critical orbit appeared in the work of Branner and Hubbard on complex cubic polynomials [BH, §12] and in Yoccoz's work [Yl, Y2] on quadratic ones, as the "worst" pattern of recurrence. On the other hand, a real quadratic Fibonacci map was suggested by Hofbauer and Keller [HK] as a possible candidate for a map having a "wild" attractor (that is, a set A which is the w-limit set for Lebesgue almost every orbit but is strictly smaller than the w-limit set for a generic orbit). The w-limit set of the critical orbit in [HK] possesses all known topological properties of wild attractors (compare [BL2]). In fact, we will see below that the quadratic Fibonacci map does not have a wild attractor; however, the corresponding question for a map with a degenerate critical point remains open. Actually, the first indication of the Fibonacci map appeared in the numerical work of Tsuda [T], related to the Belousova-Zhabotinskii reaction, and also in numerical work of Shibayama [Sh] (more precisely, they studied the sequence of "Fibonacci bifurcations" creating the Fibonacci map). This paper will study topological, geometrical, and measure-theoretical properties of the real Fibonacci map. Our goal was to figure out if this type of recurrence really gives any pathological examples and to compare it with the infinitely renormalizable patterns of recurrence studied by Sullivan [S]. It turns out that the situation can be understood completely and is of quite regular nature. In particular, any Fibonacci map (with negative Schwarzian and nondegenerate critical point) has an absolutely continuous invariant measure (so, we deal with a "regular" type of chaotic dynamics). It turns out also that geometrical properties of the closure of the critical orbit are quite different from those of the Feigenbaum map: its Hausdorff dimension is equal to zero and its geometry is not rigid but depends on one parameter. Branner and Hubbard introduce the concept of a tableau in order to describe recurrence of critical orbits. Their "Fibonacci tableau" is a basic example, which corresponds to one particularly close and regular pattern of recurrence. If a complex quadratic map z 1-+ z2 + c realizes this Fibonacci tableau, then the
منابع مشابه
Complexity of unimodal maps with aperiodic kneading sequences
It is well established that a formal language generated from a unimodal map is regular if and only if the map’s kneading sequence is either periodic or eventually periodic. A previously proposed conjecture said that if a language generated from a unimodal map is context-free, then it must be regular, i.e. there exists no proper context-free language which can be generated from a unimodal map. T...
متن کامل(Non)invertibility of Fibonacci-like unimodal maps restricted to their critical omega-limit sets
A Fibonacci(-like) unimodal map is defined by special combinatorial properties which guarantee that the critical omega-limit set ω(c) is a minimal Cantor set. In this paper we give conditions to ensure that f |ω(c) is invertible, except at a subset of the backward critical orbit. Furthermore, any finite subtree of the binary tree can appear for some f as the tree connecting all points at which ...
متن کاملOptimizing a 2D Function Satisfying Unimodality Properties
A general formulation of discrete optimization is to maximize a given function f : D → R over a discrete (finite) domain D. In general, of course, this problem may require |D| probes to f . One approach to making optimization more tractable is to be satisfied with finding a local maximum, i.e., a point at which f attains a value larger than all “neighboring” points, for some definition of neigh...
متن کاملWild Cantor Attractors Exist 3
In this paper we shall show that there exists a polynomial unimodal map f: 0; 1] ! 0; 1] with so-called Fibonacci dynamics which is non-renormalizable and in particular, for each x from a residual set, !(x) is equal to an interval; (here !(x) is deened to be the set of accumulation points of the sequence x; f(x); f 2 (x); : : :); for which the closure of the forward orbit of the critical point ...
متن کاملCube polynomial of Fibonacci and Lucas cubes
The cube polynomial of a graph is the counting polynomial for the number of induced k-dimensional hypercubes (k ≥ 0). We determine the cube polynomial of Fibonacci cubes and Lucas cubes, as well as the generating functions for the sequences of these cubes. Several explicit formulas for the coefficients of these polynomials are obtained, in particular they can be expressed with convolved Fibonac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993